Strictness of the Collapsible Pushdown Hierarchy
نویسندگان
چکیده
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by higher-order recursion schemes. This confirms the open conjecture that higher orders allow to generate more graphs and more trees.
منابع مشابه
First-Order Model Checking on Generalisations of Pushdown Graphs
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following. First-order logic with reachability is uniformly decidable on nested pushdown trees. Considering first-order logic without reachability, we prove decidability i...
متن کاملCollapsible Pushdown Graphs of Level 2 are Tree-Automatic
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow ε-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain tree-automatic whence their first-order logic theories are decidable. As a corollary we obtain the tree-automaticity of the second level of the Caucal-hierarchy.
متن کاملOn Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking Problem takes as input such a recursion scheme together with a modal μ-calculus sentence and asks for a finite representation of the set of nodes in the tree generated by the scheme at which the sentence holds. Using a...
متن کاملA First-Order Logic on Higher-Order Nested Pushdown Trees
We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.’s concept of nested pushdown trees. Nested pushdown trees are useful representations of control flows in the verification of programs with recursive calls of first-order functions. Higher-order nested pushdown trees are expansions of unfoldings of graphs generated by higher-order pushdown systems. Moreov...
متن کاملVariants of Collapsible Pushdown Systems
We analyze the relationship between three ways of generating trees using collapsible pushdown systems (CPS’s): using deterministic CPS’s, nondeterministic CPS’s, and deterministic wordaccepting CPS’s. We prove that (for each level of the CPS and each input alphabet) the three classes of trees are equal. The nontrivial translations increase n− 1 times exponentially the size of the level-n CPS. T...
متن کامل